Erratum: Prime factorization using quantum annealing and computational algebraic geometry
نویسندگان
چکیده
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used to reduce the degree of Hamiltonians.
منابع مشابه
Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division
Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P syste...
متن کاملThe Algebraic Geometry Dictionary for Beginners
This paper is a simple summary of the first most basic definitions in Algebraic Geometry as they are presented in Dummit and Foote ([1]), with a focus on establishing a dictionary between algebra and geometry. In particular this dictionary helps in visualizing certain computations that take place in polynomial rings. Among these are decomposing ideals in a manner analogous to prime factorizatio...
متن کاملar X iv : q ua nt - p h / 04 06 14 5 v 2 1 3 A ug 2 00 5 A precise estimation of the computational complexity in Shor ’ s factoring algorithm
P.W.Shor proposed the algorithm to solve the factorization into prime factors within polynomial time by using the quantum computer [1, 2]. See also [5], on the recent advances of the Shor’s factoring algorithm. In his paper, the number of the computational steps was estimated. Through this paper, we consider the case that we factorize n into finite prime numbers pi, (i = 1, · · · , k). We deriv...
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملQuantum algorithms for algebraic problems
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 7 شماره
صفحات -
تاریخ انتشار 2017